Probabilistic regular graphs
نویسندگان
چکیده
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless restricting to qualitative properties. Our results generalise those of [8], on probabilistic pushdown automata, using similar methods combined with graph grammars techniques.
منابع مشابه
Linear Arboricity and Linear k-Arboricity of Regular Graphs
We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
متن کامل(Re)introducing Regular Graph Languages
Distributions over strings and trees can be represented by probabilistic regular languages, which characterise many models in natural language processing. Recently, several datasets have become available which represent natural language phenomena as graphs, so it is natural to ask whether there is an equivalent of probabilistic regular languages for graphs. This paper presents regular graph lan...
متن کاملThe analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
The analysis of probabilistic algorithms has proved to be very successful for finding asymptotic bounds on parameters of random regular graphs. In this paper, we show that similar ideas may be used to obtain deterministic bounds for one such parameter in the case of regular graphs with large girth. More precisely, we address the problem of finding a large induced forest in a graph G, by which w...
متن کاملOnline Appendix to Domain-Independent Data Cleaning via Analysis of Entity-Relationship Graph
Notation. We will compute probabilities of certain events. Notation P(A) refers to the probability of event A to occur. We use E to denote event “E exists” for an edge E. Similarly, we use E 6∃ for event “E does not exist”. Therefore, P(E) refers to the probability that E exists. We will consider situations where the algorithm computes the probability of following (or, ‘going along’) a specific...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کامل